Weak Parametric Failure Equivalences and Their Congruence Formats
نویسندگان
چکیده
Weak equivalences are important behavioral equivalences in the course of specifying and analyzing the reactive systems using process algebraic languages. In this paper, we propose a series of weak equivalences named weak parametric failure equivalences, which take two previously-known behavioral equivalences, i.e., the weak failure equivalence and the weak impossible future equivalence, as their special cases. More importantly, based on the idea of the structural operational semantics, a series of rule formats are further presented to congruence format for their corresponding weak parametric failure equivalences, i.e., a specific equivalence is further congruent in any languages satisfying its corresponding congruence format. This series of rule formats reflect the gradual changes in the weak parametric failure equivalences. We conclude that, when the weak parametric failure equivalences become coarser, their corresponding rule formats turn tighter.
منابع مشابه
Congruence Formats for Weak Readiness Equivalence and Weak Possible Future Equivalence
Weak equivalences are important behavioral equivalences in the course of specifying and analyzing reactive systems using process algebraic languages. In this paper, we propose a series of weak equivalences named weak parametric readiness equivalences, which take two previously-known behavioral equivalences, i.e., the weak readiness equivalence and the weak possible future equivalence, as their ...
متن کاملFrom Bialgebraic Semantics to Congruence Formats
A general and abstract framework to defining congruence formats for various process equivalences is presented. The framework extends bialgebraic techniques of Turi and Plotkin with an abstract coalgebraic approach to process equivalence, based on a notion of test suite. The resulting technique is illustrated on the example of completed trace equivalence. Rather than providing formal proofs, the...
متن کاملModal Observation Equivalence of Processes
This paper shows that many simulation equivalences over processes can be characterised by a single parameterised modal logic formula. For many equivalences there is a parameterised modal logic formula f(t) such that for every pair of processes P and Q, P Q if and only if P j= f(Q). For any speci c P the formula f(P ) becomes a x point formula of the normal modal logic K . Strong bisimulation eq...
متن کاملCongruence Proofs for Weak BisimulationEquivalences on Higher { order ProcessCalculiMichael
Congruence proofs for bisimulation equivalences on higher{order process calculi tend to be signiicantly more complex than their counterparts in rst{order process algebra frameworks. The fact that higher{order synchronization invokes substitution seems to be the main problem. The reason is that it renders standard rst{order proof techniques circular in the higher{order case, and this situation i...
متن کاملFull Abstraction in Structural Operational Semantics
This paper explores the connection between semantic equivalences for concrete sequential processes, represented by means of transition systems, and formats of transition system speciications using Plotkin's structural approach. For several equivalences in the linear time { branching time spectrum a format is given, as general as possible, such that this equivalence is a congruence for all opera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008